Laguerre-like Methods with Corrections for the Inclusion of Polynomial Zeros
نویسندگان
چکیده
Iterative methods of Laguerre’s type for the simultaneous inclusion of all zeros of a polynomial are proposed. Using Newton’s and Halley’s corrections, the order of convergence of the basic method is increased from 4 to 5 and 6, respectively. Further improvements are achieved by the Gauss-Seidel approach. Using the concept of the R-order of convergence of mutually dependent sequences, we present the convergence analysis of total-step and single-step methods. The suggested algorithms possess a great computational efficiency since the increase of the convergence rate is attained without additional calculations. The case of multiple zeros is also studied. Two numerical examples are given to demonstrate the convergence properties of the proposed methods. AMS Mathematics Subject Classification (2000): 65H05, 65G20, 30C15
منابع مشابه
Improved Higher Order Method for the Inclusion of Multiple Zeros of Polynomials∗
Starting from a suitable fixed point relation and employing Schröder’s and Halley-like corrections, we derive some high order iterative methods for the simultaneous inclusion of polynomial multiple zeros in circular complex interval arithmetic. These methods are more efficient compared to the existing inclusion methods based on fixed point relations. Using the concept of the R-order of converge...
متن کاملLaguerre-like Methods for the Simultaneous Approximation of Polynomial Multiple Zeros
Two new methods of the fourth order for the simultaneous determination of multiple zeros of a polynomial are proposed. The presented methods are based on the fixed point relation of Laguerre's type and realized in ordinary complex arithmetic as well as circular complex interval arithmetic. The derived iterative formulas are suitable for the construction of modified methods with improved converg...
متن کاملOn iteration methods without derivatives for the simultaneous determination of polynomial zeros
Carstensen, C. and M.S. PetkoviC, On iteration methods without derivatives for the simultaneous determination of polynomial zeros, Journal of Computational and Applied Mathematics 45 (1993) 251-266. Several algorithms for simultaneously approximating simple complex zeros of a polynomial are presented. These algorithms use Weierstrass’ corrections and do not require any polynomial derivatives. I...
متن کاملInequalities for the polar derivative of a polynomial with $S$-fold zeros at the origin
Let $p(z)$ be a polynomial of degree $n$ and for a complex number $alpha$, let $D_{alpha}p(z)=np(z)+(alpha-z)p'(z)$ denote the polar derivative of the polynomial p(z) with respect to $alpha$. Dewan et al proved that if $p(z)$ has all its zeros in $|z| leq k, (kleq 1),$ with $s$-fold zeros at the origin then for every $alphainmathbb{C}$ with $|alpha|geq k$, begin{align*} max_{|z|=...
متن کاملBounds for Extreme Zeros of Quasi–orthogonal Ultraspherical Polynomials
We discuss and compare upper and lower bounds obtained by two different methods for the positive zero of the ultraspherical polynomial C n that is greater than 1 when −3/2 < λ <−1/2. Our first approach uses mixed three term recurrence relations and interlacing of zeros while the second approach uses a method going back to Euler and Rayleigh and already applied to Bessel functions and Laguerre a...
متن کامل